CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Themes in Broadcast Calculi

K. V. S. Prasad (Institutionen för data- och informationsteknik, Datavetenskap (Chalmers))
ISPDC 2014, IEEE 13th International Symposium on Parallel and Distributed Computing (2379-5352). p. 16-22. (2014)
[Konferensbidrag, refereegranskat]

Broadcast communication between computers became common with the Ethernet, which inspired the first, "wired", broadcast calculi. Here, senders choose what to send and when, reception is instantaneous to everyone connected to the (local) Ethernet, and contention among senders is arbitrarily resolved. These calculi were easily embedded into programming languages to express concurrent and parallel programs, and into proof checkers to give correct executable concurrent programs. They also easily accommodated priorities and time. The last wired calculi added mobility and asynchronous connections between locally synchronous nets. But such algebraic scoping matters less in the recent wireless calculi to describe MANETS and sensor networks, which note network topology separately from process structure. Wireless calculi model the hardware more closely and at different levels, so their concerns include limited and overlapping ranges of broadcasts, or collisions between them. Despite these fundamental differences, several ideas have survived from the wired into the wireless era.

Nyckelord: Ad hoc networks, Calculus, Hardware Protocols, Speech, Wireless communication, Wireless sensor networks


Article number 6900195. Invited paper.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2014-09-21. Senast ändrad 2015-10-26.
CPL Pubid: 203087

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)