Algebraic Modeling of an ad Hoc Network for Mobile Computing

✍ Scribed by Panos A. Patsouris

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 310 KB
• Volume: 61
• Category: Article
• ISSN: 0743-7315
• DOI: 10.1006/jpdc.2000.1718

✦ Synopsis

We develop an algebraic model of an ad hoc network [9] for mobile computing. The ad hoc network's structure and functionality is based (in our approach) on a pathset algebra. A pathset is the set of all paths in the network having specific source(s) and destination(s). The pathsets' set refers to a multi-digraph that constitutes the physical infrastructure of an ad hoc network. The applications, actions, andÂor services (referred to further under the general term services) are organized as multi-agent systems. The formal model of every multi-agent system is based on a modal algebra. An additional function (or special operation) couples the two algebras specifying thus the interface of their interoperability. This operation is analogous to the scalar multiplication of a vector space on a field.

2001 Academic Press agent systems. Second, the introduction of smart card technology [3,12,13] to an increasing number of application areas requires flexible and effective computing that embraces most of the aspects of the above technologies. Although security problems remain the strongest counterargument to the easy adoption of mobile