Titlebook: Ad-hoc, Mobile, and Wireless Networks; 11th International C Xiang-Yang Li,Symeon Papavassiliou,Stefan Ruehrup Conference proceedings 2012 S

新石器時(shí)代

書目名稱Ad-hoc, Mobile, and Wireless Networks影響因子(影響力)




書目名稱Ad-hoc, Mobile, and Wireless Networks影響因子(影響力)學(xué)科排名




書目名稱Ad-hoc, Mobile, and Wireless Networks網(wǎng)絡(luò)公開度




書目名稱Ad-hoc, Mobile, and Wireless Networks網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Ad-hoc, Mobile, and Wireless Networks被引頻次




書目名稱Ad-hoc, Mobile, and Wireless Networks被引頻次學(xué)科排名




書目名稱Ad-hoc, Mobile, and Wireless Networks年度引用




書目名稱Ad-hoc, Mobile, and Wireless Networks年度引用學(xué)科排名




書目名稱Ad-hoc, Mobile, and Wireless Networks讀者反饋




書目名稱Ad-hoc, Mobile, and Wireless Networks讀者反饋學(xué)科排名

間接

978-3-642-31637-1Springer-Verlag Berlin Heidelberg 2012

Supplement

https://doi.org/10.1007/978-3-662-00168-4message complexity, counted as the number of messages sent by each given node, is ., where . denotes the size of the network..We indicate the connection between our problem and the well known and deeply studied problem of the number of records in a random permutation. We generalize this problem onto

SPURN

https://doi.org/10.1007/978-3-662-00168-4adio transceivers. The nodes are in general battery-powered, thus their lifetime is limited. Therefore, algorithms for maximizing the network lifetime are of great interest. In this paper we consider the . (RMNL) problems: given a network . and a node ., the objective is to find a maximum-size colle

Chandelier

https://doi.org/10.1007/978-3-662-00168-4ely estimate distances. So far, distance estimation is often based on counting the minimum number of nodes on the shortest routing path (hop count) and presuming a fixed width for one hop. This is prone to error as the length of one hop can vary significantly. In this paper, a distance estimation me

公豬

https://doi.org/10.1007/978-3-662-00168-4g mechanisms such as MAC and routing must handle such requirements. To meet timing constraint, it is necessary to bound the hop-count between a node and the sink and the time it takes to do a hop. Thus, the end-to-end delay can be bounded and the communications are real-time. Due to the efficiency a

Presbycusis

https://doi.org/10.1007/978-3-662-00168-4d sensor angle (or field of view). We propose and study the ., a new problem concerning rotating sensors for the uninterrupted coverage of a region in the plane. More specifically, what is the initial orientation of the sensors, minimum angle, and range required so that a given (infinite or finite)

思想靈活

低能兒

https://doi.org/10.1007/978-3-662-00168-4ved for a delay-tolerant routing protocol? We address this question by introducing a general scheme for deriving the routing latency distribution for a given mobility trace. Prior work on determining latency distributions has focused on models where the node mobility is characterised by independent

不規(guī)則的跳動(dòng)