623 search results - page 83 / 125 » Packet Routing in Dynamically Changing Networks on Chip |
SSS
2007
Springer
14 years 1 months ago
2007
Springer
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
This paper presents an approach to integrate publish/subscribe semantics with on-demand multicast in wireless ad hoc networks, providing dynamic group communication with fine-gra...
NAS
2010
IEEE
13 years 6 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
TPDS
2002
13 years 7 months ago
2002
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is...
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
—In a sensor network, an important problem is to provide privacy to the event detecting sensor node and integrity to the data gathered by the node. Compromised source privacy can...